|
''Theory of Scheduling'' is a computer science book written by Richard W. Conway, William L. Maxwell, Louis W. Miller and first published in 1967. It is a classic in the field of Operations research that explores the mathematical models underlying the theory of scheduling in the context of the 1960s. The Institute for Operations Research and the Management Sciences (INFORMS) lists the book as a landmark in the history of Operations research.〔(【引用サイトリンク】title=ORIE's first Ph.D. Recipient is Honored as Loyal Alum by His Grandson, a 2010 Graduate )〕 ==Contents== The first edition of ''Theory of Scheduling'' was a collection of academic papers on the subject of scheduling. The book was written as a collaborative effort of Conway, Maxwell and a Cornell PhD student, Louis W. Miller. Their objective was to organize appropriately the subject of scheduling at the right moment. According to Robert G. Bland of the School of Operations Research and Information Engineering at Cornell University: "it placed on a formal foundation the study of the entire area of production scheduling."〔 The contents of the book include topics related to problems of sequence, measures for schedule evaluation, finite sequencing for a single machine, Finite capacity scheduling (FCS), and further problems with one operation per job. Additional chapters cover flow shop scheduling, the general n/m job-shop problem, general network problems related to scheduling, selection disciplines in a single-server queuing system, single-server queuing systems with setup classes, multiple-server queuing models, and experimental investigation of the continuous job-shop process. The book is organized in a natural sequence through 11 chapters described as follows. * Chapters 1 and 2 establish a framework and presents scheduling problems and related tools for solutions. They present an excellent perspective to interested readers from other fields. * Chapters 3 through 6 introduce the reader to an array of deterministic scheduling problems. It treats the problem of scheduling n tasks on 1 machine without sequence dependent setup costs. Chapter 4 reveals sequence dependencies while Chapter 5 treats the n task flow shop and Chapter 6 concentrates on the most general deterministic problem, the n task, m machine job shop. * Chapter 7 is concerned with network problems. It gives algorithms for determining critical paths and shortest paths of a PERT-type precedence diagram in addition to a discussion of assembly-line balancing problems. * From Chapter 8 onward, the subject of probabilistic scheduling is discussed. In particular, the concepts and techniques of finite capacity scheduling (FCS) relevant to many manufacturing problems〔Michael Pinedo, ''Scheduling Theory, Algorithms, and Systems'',Prentice Hall, 2002,pp 1-6.〕 are presented. This chapter 8 presents the formal framework of the queuing theory. This includes the probabilistic behavior of queue activities, and queuing disciplines. Chapters 9 and 10 treat single-server and multiple-server queues, respectively. * Chapter 11 is a case study of a scheduling simulation. Here queue behavior as a function of scheduling is studied for several contrived problems. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Theory of Scheduling」の詳細全文を読む スポンサード リンク
|